四元数长方矩阵的同时复对角化

利用四元数矩阵的奇异值分解(SVD),对两个四元数长矩阵给出了其同时复对角化的充要条件,进一步对一个四元数长矩阵集合,针对其同时复对角化问题,给出了一系列充分必要条件.     

纸面石膏板耐火性能试验研究

利用扫描电子显微镜，对经历不同温度和冷却方式的纸面石膏板试块的显微结构进行观察和分析。结果表明：在不同受热温度和冷却方式条件下，纸面石膏板的结构和强度将发生改变。当受热温度达到300℃时，护面纸与石膏芯材结合松动，护面纸发生热分解、炭化，石膏芯材产生裂纹，网状晶体骨架结构疏松、断裂、破碎，完整性遭到破坏，强度基本丧失；受热温度越高，纸面石膏板结构和强度的破坏越严重。     

一种利用GPS载波相位姿态测量的方法

GPS初始整周模糊度的求解是利用载波相位进行测量时的关键问题.采用了对系数矩阵进行QR分解的方法,用以降低矩阵的维数.模糊度搜索时,针对Z变换可能会引入多余误差,采用了对称三角分解法对协方差矩阵进行去相关处理.实验与仿真结果表明,定位误差在0.5 cm以内,方位角和仰角误差在0.1°以内.     

抗压防护服设计构想及应用展望

针对灭火和抢险救援过程中因建筑坍塌引发消防官兵伤亡的事故频频发生的现况,结合高压气体的受力、传力特点,提出了多级气囊缓冲式抗压防护服的设计构想;探讨了抗压防护服的材料选择和各主要部分的设计,分析了多级气囊缓冲式抗压防护服在实际灭火和抢险救援工作中得到运用的可能性,为灭火和抢险救援过程中消防人员的安全提供一定的保障。     

Benders decomposition with alternative multiple cuts for a multi‐product closed‐loop supply chain network design model

In this article, we consider a multi‐product closed‐loop supply chain network design problem where we locate collection centers and remanufacturing facilities while coordinating the forward and reverse flows in the network so as to minimize the processing, transportation, and fixed location costs. The problem of interest is motivated by the practice of an original equipment manufacturer in the automotive industry that provides service parts for vehicle maintenance and repair. We provide an effective problem formulation that is amenable to efficient Benders reformulation and an exact solution approach. More specifically, we develop an efficient dual solution approach to generate strong Benders cuts, and, in addition to the classical single Benders cut approach, we propose three different approaches for adding multiple Benders cuts. These cuts are obtained via dual problem disaggregation based either on the forward and reverse flows, or the products, or both. We present computational results which illustrate the superior performance of the proposed solution methodology with multiple Benders cuts in comparison to the branch‐and‐cut approach as well as the traditional Benders decomposition approach with a single cut. In particular, we observe that the use of multiple Benders cuts generates stronger lower bounds and promotes faster convergence to optimality. We also observe that if the model parameters are such that the different costs are not balanced, but, rather, are biased towards one of the major cost categories (processing, transportation or fixed location costs), the time required to obtain the optimal solution decreases considerably when using the proposed solution methodology as well as the branch‐and‐cut approach. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

SPH并行计算方案及其在自由表面流动模拟中的应用

针对光滑粒子动力学主要计算量是近邻粒子搜索这一特点,提出了一种基于粒子分解的光滑粒子动力学并行计算方案。利用该方案可以方便地将任意串行光滑粒子动力学代码并行计算,而且每一个时间步内的信息传递量只和粒子总数有关,而和粒子的分布无关,因而特别适合于自由表面流动等大变形问题的并行数值模拟。对一个粒子总数为40万的三维溃坝问题的模拟结果表明:此方案能达到的最大加速比约为16,这一结果可能比空间分解方案(不考虑动态负载均衡)更优。     

混合气体识别的响应等效性与瞬态信号正交分解模型

针对目前混合气体识别大多采用传感器稳态响应信号、基于线性混合假设或大量样本学习,而瞬态响应信号特征分析主要应用非正交分解的问题,提出一种基于响应等效性与瞬态信号正交分解的混合气体识别模型。分析金属氧化物半导体传感器对混合气体的响应特性,建立基于气体响应成分等效性假设的气体非线性混合模型,在此基础上,提出并应用一种新的正交基函数——扩展类Legendre正交基,对气体传感器瞬态响应信号进行分解;通过对正交分解系数与气体浓度的回归分析,验证二者之间的指数型关联关系,并以正交分解系数为特征参数,利用气体非线性等效混合模型对混合气体分解与辨识。实验结果表明,尽管这种混合气体识别模型仅用单一气体检测的先验知识,对混合气体的识别误差仍可达到15%以内。     

EEMD+BiGRU组合模型在短时交通流量预测中的应用

针对城市交通流随机波动性强、数据中含噪声多导致预测精度下降的问题,提出一种基于集合经验模态分解(ensemble empirical mode decomposition,EEMD)和双向门控循环单元(bidirectional gated recurrent unit,BiGRU)的组合交通流量预测模型,有效地提升了短时交通流预测的精度。模型利用EEMD算法对原始数据进行分解,根据分解所得的本征模函数(intrinsic mode function,IMF)分量绘制噪声能量图谱,去除分量中的噪声,并将去噪后的IMF分量作为BiGRU网络的输入进行训练,再将训练所得的结果进行重构加和,得到最终的预测结果。实验结果表明,未舍弃含有噪声的IMF分量进行重构的预测结果,相比于参考文献中提出的EMD+LSTM模型、LSTM模型和EEMD+LSTM模型,其平均绝对百分误差分别优化了42.36%、61.82%和30.95%;舍弃含有噪声的IMF分量后进行重构的预测结果,其平均绝对百分误差相比于将全部IMF分量进行重构优化了56.62%。     

深 V 型船艉扰流板减阻模型试验及数值分析

为深入研究深 V 型船艉扰流板减阻机理,首先进行了深 V 型船艉扰流板系列减阻模型试验研究,获得了模型阻力减少4％左右的艉扰流板设计方案,该方案扰流板深度与艉板宽度之比为0．0094;其次,采用RANS 方程以及计及航态影响的数值计算方法,逐段分析了船体微段阻力变化规律。结果表明：扰流板减阻的主要原因在于其改善了船体航态,从而减少了压差阻力。     

On the hierarchy of γ‐valid cuts in global optimization

Concavity Cuts play an important role in concave minimization. In Porembski, J Global Optim 15 ( 17 ), 371–404 we extended the concept underlying concavity cuts which led to the development of decomposition cuts. In numerical experiments with pure cutting plane algorithms for concave minimization, decomposition cuts have been shown to be superior to concavity cuts. However, three points remained open. First, how to derive decomposition cuts in the degenerate case. Second, how to ensure dominance of decomposition cuts over concavity cuts. Third, how to ensure the finite convergence of a pure cutting plane algorithm solely by decomposition cuts. These points will be addressed in this paper. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2008